Executing Formal Specifications by Translation to Higher Order Logic Programming
نویسنده
چکیده
We describe the construction and use of a system for translating higher order logic-based speciications into programs in the higher order logic programming language Lambda Prolog. The translation improves on previous work in the eld of executing speciications by allowing formulas with quantiiers to be executed, and by permitting users to pose Prolog-style queries with free variables to be instantiated by the system. We also discuss various alternative target languages and design decisions in implementing the translator.
منابع مشابه
Realizing the Dependently Typed Λ-calculus
Dependently typed λ-calculi such as the Edinburgh Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and their proofs. Such calculi can also be given a logic programming interpretation: the system is based on such an interpretation of LF. We have considered whether a conventional logic programming language can also p...
متن کاملTranslating Specifications in a Dependently Typed Lambda Calculus into a Predicate Logic Form
Dependently typed lambda calculi such as the Edinburgh Logical Framework (LF) are a popular means for encoding rule-based specifications concerning formal syntactic objects. In these frameworks, relations over terms representing formal objects are naturally captured by making use of the dependent structure of types. We consider here the meaning-preserving translation of specifications written i...
متن کاملTabled Higher-Order Logic Programming
A logical framework is a general meta-language for specifying and implementing deductive systems, given by axioms and inference rules. Based on a higher-order logic programming interpretation, it supports executing logical systems and reasoning with and about them, thereby reducing the effort required for each particular logical system. In this thesis, we describe different techniques to improv...
متن کاملPure Logic Program Compilation and Improvement (Optimization) Via Programmer-Controlled Transformations Fourth Generation Languages Done Right
I describe a novel hybrid approach to efficient parallel implementation of declaratively (and formally) specified applications. My approach proposes novel languages that support formal refinement and parallel distributions. I defer the complexity of designing user-level programming language features in favor of designing intermediate languages with specific properties and sufficient generality....
متن کاملCode generation from specifications in higher-order logic
A very rigorous weapon against implementation errors in software systems is formal verification: both the desired behaviour (abstract specification) and the implementation (executable specification) are formalised in a suitable logical calculus, and the equivalence of both is proved. The numerous technical details involved in such a procedure suggest to let a proof assistant check all proof ste...
متن کامل